A First-order Logic with Frames
نویسندگان
چکیده
We propose a novel logic, Frame Logic (FL), that extends first-order logic and recursive definitions with construct Sp (·) captures the implicit supports of formulas—the precise subset universe upon which their meaning depends. Using such supports, we formulate proof rules facilitate frame reasoning elegantly when underlying model undergoes change. show is expressive by capturing several data-structures also exhibit translation from fragment separation to logic. Finally, design program based on for programs dynamically update heaps facilitates local specifications reasoning. This consists both localized as well derive weakest tightest preconditions in
منابع مشابه
Computing with First-Order Logic
We study two important extensions of rst-order logic (FO) with iteration, the xpoint and while queries. The main result of the paper concerns the open problem of the relationship between xpoint and while: they are the same ii ptime = pspace. These and other expressibility results are obtained using a powerful normal form for while which shows that each while computation over an unordered domain...
متن کاملA First-Order Logic with First-Class Types
This paper presents a strongly complete calculus for a firstorder statically-typed predicate logic with first-class types, type predicates and casts, provided that the type hierarchy is Noetherian. We show that this restriction cannot be relaxed.
متن کاملTaming First-Order Logic
In this paper we define computationally well-behaved versions of classical first-order logic and prove that the validity problem is decidable1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2023
ISSN: ['1558-4593', '0164-0925']
DOI: https://doi.org/10.1145/3583057